Nuprl Lemma : fun-connected-fixedpoint
11,40
postcript
pdf
T
:Type,
f
:(
T
T
),
x
,
y
:
T
.
x
is
f
*(
y
)
(
f
(
y
) =
y
)
(
x
=
y
)
latex
Definitions
t
T
,
x
:
A
B
(
x
)
,
Type
,
s
=
t
,
,
x
:
A
.
B
(
x
)
,
A
,
f
(
a
)
,
<
a
,
b
>
,
,
y
is
f
*(
x
)
,
Void
,
P
Q
,
False
,
x
:
A
B
(
x
)
,
x
:
A
.
B
(
x
)
,
hd(
l
)
,
y
=
f
*(
x
) via
L
,
(
x
l
)
,
type
List
,
x
.
A
(
x
)
,
{
T
}
,
x
,
y
.
t
(
x
;
y
)
Lemmas
fun-connected-induction
,
fun-connected
wf
,
not
wf
origin
T:Type, f:(T
T), x, y:T. x is f*(y) 
(f(y) = y) (x = y) T:Type, f:(TT), x, y:T. x is f*(y) (f(y) = y) (x = y) 
TB(x)
x:A. B(x)
A
Q
B(x)
x:A. B(x) l)
x.A(x)
x,y. t(x;y)